On the Finite Convergence of Successive Sdp Relaxation Methods ? Y Research of This Author Was Supported in Part by a Grant from Nserc and a Prea
نویسنده
چکیده
Let F be a subset of the n-dimensional Euclidean space R n represented in terms of a compact convex subset C 0 and a set P F of nitely or innnitely many quadratic functions on R n such that F = fx 2 C 0 : p(x) 0 (8p() 2 P F)g. In this paper, we investigate some fundamental properties related to the nite convergence of the successive SDP (semideenite programming) relaxation method proposed by the authors for approximating the convex hull of F.
منابع مشابه
Generalized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملOn the finite convergence of successive SDP relaxation methods
Let F be a subset of the n-dimensional Euclidean spaceR represented in terms of a compact convex subset C0 and a set PF of nitely or in nitely many quadratic functions on R such that F = fx 2 C0 : p(x) 0 (8p( ) 2 PF )g. In this paper, we investigate some fundamental properties related to the nite convergence of the successive SDP (semide nite programming) relaxation method proposed by the autho...
متن کاملComputing Distances between Evolutionary Trees
Supported in part by a CGAT (Canadian Genome Analysis and Technology) grant. Work done while the author was at McMaster University and University of Waterloo. Supported in part by NSF grant 9205982 and CGAT. Supported in part by NSERC Operating Grant OGP0046613 and CGAT. Supported in part by the NSERC Operating Grant OGP0046506 and CGAT. Supported in part by CGAT and NSERC Internation Fellowshi...
متن کاملOn the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
We compare the relative strength of valid inequalities for the integer hull of the feasible region of mixed integer linear programs with two equality constraints, two unrestricted integer variables and any number of nonnegative continuous variables. In particular, we prove that the closure of Type 2 triangle (resp. Type 3 triangle; quadrilateral) inequalities, are all within a factor of 1.5 of ...
متن کاملModified Successive Overrelaxation (MSOR) and Equivalent 2-Step Iterative Methods for Collocation Matrices
We consider a class of consistently ordered matrices which arise from the discretization of Boundary Value Problems (BVPs) when the finite element collocation method, with Hermite elements, is used. Through a recently derived equivalence relationship for the asymptotic rates of convergence of the Modified Successive Overrelaxation (MSOR) and a certain 2-step iterative method, we determine the o...
متن کامل